Перевод: с русского на все языки

со всех языков на русский

maximum problem

См. также в других словарях:

  • Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… …   Wikipedia

  • Maximum likelihood sequence estimation — (MLSE) is a mathematical algorithm to extract useful data out of a noisy data stream. Contents 1 Theory 2 Background 3 References 4 Further reading …   Wikipedia

  • Maximum Ride — Maximum Ride: The Angel Experiment Maximum Ride: School s Out Forever Maximum Ride: Saving the World and Other Extreme Sports Maximum Ride: The Final Warning MAX: A Maximum Ride Novel Fang: A Maximum Ride Novel Angel: A Maximum Ride Novel… …   Wikipedia

  • Maximum Boy —   Author(s) Dan Greenburg Illustrator Greg Swearingen …   Wikipedia

  • Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network …   Wikipedia

  • Maximum cut — A maximum cut. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max cut problem. The problem can be stated simply as follows. One wants a subset… …   Wikipedia

  • Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… …   Wikipedia

  • Maximum coverage problem — The maximum coverage problem is a classical question in computer science and computational complexity theory. It is a problem that is widely taught in approximation algorithms. As input you are given several sets and a number k. The sets may have …   Wikipedia

  • Maximum satisfiability problem — In computational complexity theory, the Maximum Satisfiability problem (MAX SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be satisfied by some assignment. It is an FNP generalization of SAT …   Wikipedia

  • Maximum subarray problem — In computer science, the maximum subarray problem is the task of finding the contiguous subarray within a one dimensional array of numbers (containing at least one positive number) which has the largest sum. For example, for the sequence of… …   Wikipedia

  • Maximum likelihood — In statistics, maximum likelihood estimation (MLE) is a method of estimating the parameters of a statistical model. When applied to a data set and given a statistical model, maximum likelihood estimation provides estimates for the model s… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»